Domination Parameter Characterization using Matrix Representation
نویسندگان
چکیده
منابع مشابه
On the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
متن کاملVector representation of graph domination
We study a function on graphs, denoted by Gamma , representing vectorially the domination number of a graph, in a way similar to that in which the Lovász Theta function represents the independence number of a graph. This function is a lower bound on the homological connectivity of the independence complex of the graph, and hence is of value in studying matching problems by topological methods. ...
متن کاملA characterization relating domination, semitotal domination and total Roman domination in trees
A total Roman dominating function on a graph $G$ is a function $f: V(G) rightarrow {0,1,2}$ such that for every vertex $vin V(G)$ with $f(v)=0$ there exists a vertex $uin V(G)$ adjacent to $v$ with $f(u)=2$, and the subgraph induced by the set ${xin V(G): f(x)geq 1}$ has no isolated vertices. The total Roman domination number of $G$, denoted $gamma_{tR}(G)$, is the minimum weight $omega(f)=sum_...
متن کاملReduction of Domination Parameter in Fuzzy Graphs
In this paper, the cobondage set and cobondage number bC(G) of a fuzzy graph G are defined. The upper bound of a fuzzy graph with p nodes is given as min(p − (1 + S(G)), S(G) + 1). The exact values of bC(G) for some standard fuzzy graphs are found. Some results on bC(G) are also discussed. A numerical example is also illustrated. AMS subject classification: 03E72, 05C40, 05C72.
متن کاملExtended Generalized Feistel Networks Using Matrix Representation
While Generalized Feistel Networks have been widely studied in the literature as a building block of a block cipher, we propose in this paper a unified vision to easily represent them through a matrix representation. We then propose a new class of such schemes called Extended Generalized Feistel Networks well suited for cryptographic applications. We instantiate those proposals into two particu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2015
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2015/v8i15/54072